Character Recognition using Discrete Curve with the use of Approximate String Matching

نویسندگان

  • Samit Kumar Pradhan
  • Sujoy Sarkar
  • Rafael C. Gonzalez
  • A. K. Pujari
  • C. D. Naidu
  • M. S. Rao
چکیده

This paper deals with the recognition of printed basic Telugu characters using the discrete curves and approximation string matching. The features are extracted from smoothed images, obtained after the thinning operation. As by only thinning, spines may arise which will affect the recognition of the character. The features are the discrete curves, specified using the 3×3 regions of connected component representation. We represent the discrete curves in the form of a string, so the set of discrete curves result a set of strings. Then using the string matching operation we compare the string obtained from the stored character with the string obtained from the extracted character. As we are dealing with the characters so there may be the

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Stroke Sequence String Matching Algorithm for Character Recognition and Analysis

Given two character images, we would like to measure their similarity or difference. Such a similarity or difference measure facilitates the solution to character recognition and handwriting analysis problems. There is, however, no universal definition for similarity measure satisfying wide range of characteristics such as the slant, deformation or other invariant constraints. For this reason, ...

متن کامل

Cross-Domain Approximate String Matching

Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new formalism for a class of applications that takes two strings as input, each specified in terms of a particular domain, and performs a comparison motivated by constraints derived from a third, possibly different domain. ...

متن کامل

Approximate string matching algorithms for limited-vocabulary OCR output correction

Five methods for matching words mistranslated by optical character recognition to their most likely match in a reference dictionary were tested on data from the archives of the National Library of Medicine. The methods, including an adaptation of the cross correlation algorithm, the generic edit distance algorithm, the edit distance algorithm with a probabilistic substitution matrix, Bayesian a...

متن کامل

Face Recognition using Approximate String Matching

String matching algorithm is a very useful algorithm in pattern matching that can be used to match any patterns that can be represented in strings or sequence. This paper will discussed how string matching can be used as a method for face recognition. We will focus on the implementation using approximate string matching. In order for face images to be implemented in pattern matching, they have ...

متن کامل

Measuring the impact of character recognition errors on downstream text analysis

Noise presents a serious challenge in optical character recognition, as well as in the downstream applications that make use of its outputs as inputs. In this paper, we describe a paradigm for measuring the impact of recognition errors on the stages of a standard text analysis pipeline: sentence boundary detection, tokenization, and part-of-speech tagging. Employing a hierarchical methodology b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013